Models of set theory with definable ordinals
نویسنده
چکیده
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO models and showed that (1) every consistent extension T of ZF has a DO model, and (2) for complete extensions T, T has a unique DO model up to isomorphism iff T proves V = OD. Here we provide a comprehensive treatment of Paris models. Our results include the following: 1. If T is a consistent completion of ZF+V =OD then T has continuummany countable nonisomorphic Paris models. 2. Every countable model of ZFC has a Paris generic extension. 3. If there is an uncountable well-founded model of ZFC, then for every infinite cardinal κ there is a Paris model of ZF of cardinality κ which has a nontrivial automorphism. 4. For a model M ZF ,M is a prime model ⇒M is a Paris model and satisfies AC ⇒M is a minimal model. Moreover, Neither implication reverses assuming Con(ZF).
منابع مشابه
Metarecursively Enumerable Sets and Admissible Ordinals
Here we describe some results which will be proved in detail in [13] and [l4]. The notion of metarecursive set was introduced in [8]. Kreisel [7] reported on some of the model-theoretic deliberations which preceded the definitions of [8]. Metarecursion theory is a generalization of ordinary recursion theory from the natural numbers to the recursive ordinals. Theorems about finite sets of natura...
متن کاملAn ordinal analysis of admissible set theory using recursion on ordinal notations ∗ Jeremy Avigad
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...
متن کاملMonadic Definability of Ordinals
We identify precisely which singular ordinals are definable by monadic second order formulae over the ordinals, assuming knowledge of the definable regular cardi-
متن کاملAn Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...
متن کاملGuessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary subsets of ω1 (assuming the existence of an inaccessible limit of measurable cardinals). Here, given a pair (β0, β1) of ordinals, we will say that a stationary set S ⊆ ω1 has guessing density (β0, β1) if β0 = γ(S) and β1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 44 شماره
صفحات -
تاریخ انتشار 2005